Flexible Feature Deletion: Compacting Case Bases by Selectively Compressing Case Contents

نویسندگان

  • David B. Leake
  • Brian Schack
چکیده

Extensive research in case-base maintenance has studied methods for achieving compact, competent case bases. This work has examined how to achieve good solution performance while limiting the number of cases retained, using approaches such as competence-based case deletion. Two fundamental assumptions of such approaches have been (1) that cases are approximately the same size and (2) that the only way to affect case base size is by deleting or retaining entire cases. However, in some domains different cases may contain different amounts of information, causing widely varying case sizes, and case solutions may themselves be compressible, with the ability to selectively delete portions of indices or solutions while still retaining varying levels of usefulness. In accordance with this more flexible view, this paper proposes a new maintenance approach, flexible feature deletion, which removes parts of cases, enabling compression of the case base by selective—and possibly non-uniform—size reduction of individual cases. It proposes and evaluates an initial set of feature deletion strategies. Experimental results support that when cases have varying size and compressible contents, flexible feature deletion strategies may enable better system performance than case-oriented strategies for the same level of compression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Feature Relevance Heuristic for Indexing and Compressing Large Case Bases

This paper reports results with igtree a formalism for index ing and compressing large case bases in Instance Based Learning ibl and other lazy learning techniques The concept of information gain en tropy minimisation is used as a heuristic feature relevance function for performing the compression of the case base into a tree igtree reduces storage requirements and the time required to compute ...

متن کامل

Adaptation-Guided Case Base Maintenance

In case-based reasoning (CBR), problems are solved by retrieving prior cases and adapting their solutions to fit; learning occurs as new cases are stored. Controlling the growth of the case base is a fundamental problem, and research on case-base maintenance has developed methods for compacting case bases while maintaining system competence, primarily by competencebased deletion strategies assu...

متن کامل

A Feature - Relevance Heuristic for Indexing andCompressing Large Case

This paper reports results with igtree, a formalism for indexing and compressing large case bases in Instance-Based Learning (ibl) and other lazy-learning techniques. The concept of information gain (en-tropy minimisation) is used as a heuristic feature-relevance function for performing the compression of the case base into a tree. igtree reduces storage requirements and the time required to co...

متن کامل

Guiding Case-Base Maintenance: Competence and Performance?

The fundamental knowledge container in case-based reasoning is the case base of prior experiences. An important focus of recent CBR research is on maintenance strategies for achieving compact, competent case bases, as a way to improve the performance of CBR systems. However, the actual tradeoos between competence, compactness, and performance may be complex. Consequently, this paper argues for ...

متن کامل

Remembering Why to Remember: Performance-Guided Case-Base Maintenance

An important focus of recent CBR research is on how to develop strategies for achieving compact, competent case-bases, as a way to improve the performance of CBR systems. However, compactness and competence are not always good predictors of performance, especially when problem distributions are non-uniform. Consequently, this paper argues for developing methods that tie case-base maintenance mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015